Analysis on queuing problem of charges windows of telepone subscriber 電話交費窗口用戶排隊分析
With isolation from each other , data can be mixed on the line without queuing problems at the packet layer 有了這些信息流相互之間的隔離(技術(shù)) ,數(shù)據(jù)可以在線路上混合起來而不存在包這一層上的排隊問題。
Then , the resource conflict problem was transformed into queue problem to realize interaction among resources by setting up a message queue 同時建立消息隊列,把資源沖突問題轉(zhuǎn)化為隊列排隊問題,實現(xiàn)資源與資源的交互處理。
At the busy time , the utilization of the system resources increases from nearly 80 % to 95 % or up , and there is no job queuing problem when one or more cpus are idle 繁忙期間的系統(tǒng)利用率從集群系統(tǒng)初建時的80 %左右提高到95 %以上,只要集群系統(tǒng)中有cpu空閑就不會出現(xiàn)作業(yè)排隊等待的現(xiàn)象。
The queueing problems of cbr traffic in atm networks are analyzed . simple closed expressions of the upper bound on the cell loss ratio ( clr ) and mean cell delay in a finite buffer system are derived 分析了atm網(wǎng)絡(luò)cbk業(yè)務(wù)排隊性能,給出了一種簡單的計算cbr業(yè)務(wù)信元丟失率上界和信元平均時延的解析表達式。